Persistent Path Homology of Directed Networks
نویسندگان
چکیده
منابع مشابه
Persistent Path Homology of Directed Networks Samir Chowdhury and Facundo
While standard persistent homology has been successful in extracting information from metric datasets, its applicability to more general data, e.g. directed networks, is hindered by its natural insensitivity to asymmetry. We study a construction of homology of digraphs due to Grigor’yan, Lin, Muranov and Yau, and extend this construction to the persistent framework. The result, which we call pe...
متن کاملPersistent Path Homology of Directed Networks Samir Chowdhury and Facundo Mémoli
While standard persistent homology has been successful in extracting information from metric datasets, its applicability to more general data, e.g. directed networks, is hindered by its natural insensitivity to asymmetry. We extend a construction of homology of digraphs due to Grigoryan, Lin, Muranov and Yau to the persistent framework. The result, which we call persistent path homology or PPH,...
متن کاملConvergence of Hierarchical Clustering and Persistent Homology Methods on Directed Networks
While there has been much interest in adapting conventional clustering procedures—and in higher dimensions, persistent homology methods—to directed networks, little is known about the convergence of such methods. In order to even formulate the problem of convergence for such methods, one needs to stipulate a reasonable model for a directed network together with a flexible sampling theory for su...
متن کاملCosheaf Theoretical Constructions in Networks and Persistent Homology
In this paper, we study data flows in directed networks with a hierarchical recurrent structure from a cosheaf theoretical perspective. We utilize the visual parametrization of directed recurrent programs provided in persistence diagrams for cosheaf theoretical constructions. In considering cosheaves on persistence diagrams, we link global network structure and local recurrent process data. An ...
متن کاملEvasion paths in mobile sensor networks
Suppose that ball-shaped sensors wander in a bounded domain. A sensor doesn’t know its location but does know when it overlaps a nearby sensor. We say that an evasion path exists in this sensor network if a moving intruder can avoid detection. In Coordinate-free coverage in sensor networks with controlled boundaries via homology, Vin de Silva and Robert Ghrist give a necessary condition, depend...
متن کامل